Compressed Pattern Databases
نویسندگان
چکیده
منابع مشابه
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct entry in the table for each subproblem instance. In this paper we investigate compressing PDBs by merging several entries into one, thereby allowing the use of PDBs that exceed available memory in their uncompressed f...
متن کاملOn Variable Dependencies and Compressed Pattern Databases
Pattern databases are among the strongest known heuristics for many classical search benchmarks such as sliding-tile puzzles, the 4-peg Towers of Hanoi puzzles, Rubik’s Cube, and TopSpin. Min-compression is a generally applicable technique for augmenting pattern database heuristics that has led to marked experimental improvements in some settings, while being ineffective in others. We provide a...
متن کاملSearching in Compressed Image Databases
Content-based image retrieval consists in retrieving from an image database the most similar image with respect to a query, according to some similarity measure. This scenario has numerous specific applications that include bioinformatics and medical imaging, among others. However, because the size of image repositories grows very fast, finding patterns in images requires an index to avoid a se...
متن کاملPattern Databases
The efficiency of A* searching depends on the quality of the lower bound estimates of the solution cost. Pattern databases enumerate all possible subgoals required by any solution, subject to constraints on the subgoal size. Each subgoal in the database provides a tight lower bound on the cost of achieving it. For a given state in the search space, all possible subgoals are looked up in the pat...
متن کاملTransposition Algorithms on Very Large Compressed Databases
Transposition is the dominant operation for very large srirnlifir and statistical databses. This paper presents four efficient transposilion algorithms for very large compressed scientific and statistical databases. These algorithms operate directly on compressrd data without the need to first drromprrss thrm. TI lc) arc applirablr 1.0 dnlabascs that are compressed using the general (and popula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2007
ISSN: 1076-9757
DOI: 10.1613/jair.2241